A Genetic Algorithm Applying Single Point Crossover and Uniform Mutation to Minimize Uncertainty in Production Cost

نویسندگان

  • Niju P. Joseph
  • B. Ramadoss
چکیده

Efficient and effective management of production cost is carried out by identifying the uncertainty in production planning in supply chain. Thus the determination of the uncertainty factors at various levels in a supply chain becomes inevitable so as to ensure minimal Cost for the manufacturing process. Minimizing the total supply chain cost is meant for minimizing labour, material and minimizing cost in the entire supply chain. The minimization of the total production cost can only be achieved when is carried out at each member of the production chain. For production planning, one typically needs to determine the variable production costs, including manufacturing costs, Labor cost, materials cost, inventory holding costs and any relevant resource acquisition costs. A serious issue in the implementation of the same is that cost level is not static for every period and for every category. In this paper, we have developed a new and efficient approach that works on Genetic Algorithms in order to minimize production cost.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMAL OPERATORS OF GENETIC ALGORITHM IN OPTIMIZING SEGMENTAL PRECAST CONCRETE BRIDGES SUPERSTRUCTURE

Bridges constitute an expensive segment of construction projects; the optimization of their designs will affect their high cost. Segmental precast concrete bridges are one of the most commonly serviced bridges built for mid and long spans. Genetic algorithm is one of the most widely applied meta-heuristic algorithms due to its ability in optimizing cost. Next to providing cost optimization of t...

متن کامل

A Novel Experimental Analysis of the Minimum Cost Flow Problem

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

متن کامل

Return on Investment in Transmission Network Expansion Planning Considering Wind Generation Uncertainties Applying Non-dominated Sorting Genetic Algorithm

Although significant private investment is absorbed in different sectors of power systems, transmission sector is still suffering from appropriate private investment. This is because of the pricing policies of transmission services, tariffs, and especially for investment risks. Investment risks are due to the uncertain behaviour of power systems that discourage investors to invest in the transm...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

Optimal Scheduled Unit Commitment Considering Wind Uncertainty Using Cuckoo Search Algorithm

In this paper, a new method to review the role of wind units as an energy-producer in the scheduling problem of unit commitment is presented. Today, renewable energy sources due to lack of environmental pollution, absence of dependence on fossil fuels, and consequently a very low marginal cost, have been receiving considerable attention in power system. But these sources are associated with unc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013